Combinatorial PDEs on Hamming graphs
نویسندگان
چکیده
منابع مشابه
On spanning tree congestion of Hamming graphs
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
متن کاملNeighbour transitivity on codes in Hamming graphs
We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neigh...
متن کاملSolitaire Clobber Played on Hamming Graphs
The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones. The game is interesting if there is at least one stone of e...
متن کاملOn Robust Colorings of Hamming-Distance Graphs
Hq(n, d) is defined as the graph with vertex set Zq and where two vertices are adjacent if their Hamming distance is at least d. The chromatic number of these graphs is presented for various sets of parameters (q, n, d). For the 4-colorings of the graphs H2(n, n − 1) a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness...
متن کاملOn k-partitioning of Hamming Graphs
We consider the graphs Hn a defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A1, . . . , Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00363-6